﻿#include "name_space.h"
#include <iostream>
#include <math.h>
#include "link_list.h"
#include "binary_tree.h"
#include <algorithm>
#include <iostream>
using namespace std;
void main()
{
	//controlCPU();
	//p_5_2_1();
	//p_5_2_2();
	//p_5_5();

	///************Introduction To Algorithm************///
	
	//testInsertionSort();
	//testHeapSort();
	testQuickSort();
	//testCountingSort();
	//testGoogleSort();
	//testSelectProblem();
	//testHashTable();
	//testBinarySearchTree();
	//testCarFix(8);
	//testMatMultiply();
	//testLCS();
	//testOptimalBST();
	//testMathTower();
	//testMaxSubsequenceSum();
	//testKnapsack_01();
	//testKnapsack_part();
	//testGreedyActivitySelector();
	///********************BAIDU************************///
	//star_2012_1211_01();
	//star_2012_1211_02_A();
	//star_2012_1211_02_B();
	//star_2012_1223_01();
	//star_2012_1230_01();
	//star_2013_0110_02();
	//bds_2012_03();
	//bds_2012_04();
	//bds_2012_05();
	//bds_2012_07();
	//bds_2012_08();
	//bds_2012_09();
	//bds_2012_09_web();
	///********************PRIMER***********************///
	//testObejectOriented();
	//testString();
	//testIterator();
	//bitsetTest();
	///********************TREND***********************///
	//testTrend2011();

	///********************RECURSION********************///
	//testRecursion();

	///******************COMMON_PROBLEM*****************///
	//testPermutation();
	//testPackProblem();
	//TestEightQueen();

	///******************JIANZHI_OFFER*****************///
	//testSizeof();		//sizeof问题
	//testSearchNumber();
	//testReplaceSpace();
	//TestNumberOf1();
	//TestInOrderPop();
	//TestIsPosterBinarySearchTree();

	///********************GraphViz*******************///
	//testGrapViz();

	///********************XXL_TEST*******************///
	//testException();
	//testCtorDtorOrder();

	///*****************data structure**************///
	//TestLinkList();
	//TestBinaryTree();
	system("pause");
}

